Mixed Tasks Scheduling Using Improved Synthetic Utilization on Multiprocessor Systems
نویسندگان
چکیده
منابع مشابه
Scheduling Tasks in Multiprocessor Systems Using Evolutionary Strategies
Scheduling tasks in multiprocessor systems is a difficult problem. This paper describes a method based upon evolutionary strategies to aid in finding good task assignments. The technique is illustrated be scheduling a digital signal processing algorithm on a two processor distributed system.
متن کاملOn static scheduling of tasks in real time multiprocessor systems: an improved GA-based approach
Task execution Deadline Time (DL) in real-time systems is a critical constraint. Every task should have a Maximum Computational Time (MCT) that is needed before reaching a given DL time. Scheduling jobs in real-time systems is thus a nondeterministic polynomial NP problem. Three algorithms can be found in literature to solve these problems in a multi processor environment; are the Earliest Dead...
متن کاملFixed-Priority Scheduling of Periodic Tasks on Multiprocessor Systems
Consider the problem of periodic task scheduling, in which we seek to minimize the total number of processors required to execute a set of tasks such that task deadlines are guaranteed by the Rate-Monotonic (or RM) algorithm on each processor. This problem was rst investigated by Dhall and Liu, and the previous lowest bound for the problem was 2.0. In this paper, an improved solution is given b...
متن کاملImproved bounds for hybrid flow shop scheduling with multiprocessor tasks
In this paper, we investigate the problem of minimizing makespan in a multistage hybrid flow-shop scheduling with multiprocessor tasks. To generate high-quality approximate solutions to this challenging NP-hard problem, we propose a discrepancy search heuristic that is based on the new concept of adjacent discrepancies. Moreover, we describe a new lower bound based on the concept of dual feasib...
متن کاملScheduling multiprocessor tasks on two parallel processors
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Institute of Information and Communication Engineering
سال: 2015
ISSN: 2234-4772
DOI: 10.6109/jkiice.2015.19.2.351